منابع مشابه
2. Robinson and Sra¤a
In this chapter I follow the evolution of Joan Robinsons appreciation of Sra¤as critique of economic theoryover the years. My purpose is twofold: rst, to construct a narrative based also on the archival ndings; second, to shed some light on certain dividing issuesas we shall see in the nal section which impinged on the fortunes of the Cambridge school, in search of a clue to explain ...
متن کاملThompson Digraphs: A Characterization
A nite-state machine is called a Thompson machine if it can be constructed from a regular expression using Thompson's construction. We call the underlying digraph of a Thompson machine a Thompson di-graph. We establish and prove a characterization of Thompson digraphs. As one application of the characterization, we give an algorithm that generates an equivalent regular expression from a Thompso...
متن کاملThompson rings in a disk
We discuss basic principles of self-organization of a finite number of charged particles interacting via the 1/r Coulomb potential in a disk geometry. The analysis is based on the cyclic symmetry and periodicity of the Coulomb interaction between particles located on several rings. As a result, a system of equations is derived, which provides the shell structure exhibited by charged particles. ...
متن کاملA conversation with Craig Thompson.
Craig Thompson, President and CEO of Memorial Sloan Kettering Cancer Center, is a medical oncologist and immunologist who has made fundamental contributions to our understanding of how cells — from B and T cells to stem cells and cancer cells — survive and replicate. See the full interview at https://www.jci. org/videos/cgms to hear Thompson’s (Figure 1) stories about being a remedial reader, t...
متن کاملA Tutorial on Thompson Sampling
Thompson sampling is an algorithm for online decision problems where actions are taken sequentially in a manner that must balance between exploiting what is known to maximize immediate performance and investing to accumulate new information that may improve future performance. The algorithm addresses a broad range of problems in a computationally efficient manner and is therefore enjoying wide ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Belas Infiéis
سال: 2020
ISSN: 2316-6614
DOI: 10.26512/belasinfieis.v9.n2.2020.27968